A Connection Based Proof Method for Intuitionistic Logic
نویسنده
چکیده
P. Baumgartner, R. Hähnle & J. Posegga, ed., 4 International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX 95), LNAI 918, pp. 122–137, c ©Springer Verlag, 1995 Abstract. We present a proof method for intuitionistic logic based on Wallen’s matrix characterization. Our approach combines the connection calculus and the sequent calculus. The search technique is based on notions of paths and connections and thus avoids redundancies in the search space. During the proof search the computed first-order and intuitionistic substitutions are used to simultaneously construct a sequent proof which is more human oriented than the matrix proof. This allows to use our method within interactive proof environments. Furthermore we can consider local substitutions instead of global ones and treat substitutions occurring in different branches of the sequent proof independently. This reduces the number of extra copies of formulae to be considered.
منابع مشابه
Guiding Program Development Systems by a Connection Based Proof Strategy
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s connection method for classical predicate logic. It generates a matrix proof which will then be transformed into a proof within a standard sequent calculus. Thus we can use an efficient proof method to guide the development ...
متن کاملGuiding Program Development Systems by a Connection Based Proof Strategy Guiding Program Development Systems by a Connection Based Proof Strategy
We present an automated proof method for constructive logic based on Wallen's matrix characterization for intuitionistic validity. The proof search strategy extends Bibel's connection method for classical predicate logic. It generates a matrix proof which will then be transformed into a proof within a standard sequent calculus. Thus we can use an eecient proof method to guide the development of...
متن کاملConnection-based Theorem Proving in Classical and Non-classical Logics
We present a uniform procedure for proof search in classical logic, intuitionistic logic, various modal logics, and fragments of linear logic. It is based on matrix characterizations of validity in these logics and extends Bibel’s connection method, originally developed for classical logic, accordingly. Besides combining a variety of different logics it can also be used to guide the development...
متن کاملEvaluating Construction Projects by a New Group Decision-Making Model Based on Intuitionistic Fuzzy Logic Concepts
Select an appropriate project is a main key for contractors to increase their profits. In practice, in this area the uncertainty and imprecise of the involved parameters is so high. Therefore, considering fuzzy sets theory to deal with uncertainly is more appreciate. The aim of this paper is present a multi-criteria group decision-making model under an intuitionistic fuzzy set environment. Henc...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995